Principled Graph Matching Algorithms for Integrating Multiple Data Sources
نویسندگان
چکیده
منابع مشابه
Integrating multiple knowledge sources for word hypotheses graph interpretation
We present an integrated approach for the interpretation of word hypotheses graphs (WHGs) using multiple knowledge sources. Commonly, di erent knowledge sources in speech understanding are applied sequentially. Typically, speech understanding systems, such as the Verbmobil speech-to-speech translation system, rst use a word recognizer to determine word hypotheses, only based on acoustic and lan...
متن کاملProbabilistic method for integrating multiple sources of range data
It is suggested that passive-camera range-sensing methods be considered as returning not just range values but rather probability density functions, characterized by two-dimensional arrays of both expected value and variance. Employing variance data permits probabilistic integration of the range values from multiple range-sensing algorithms , with results demonstrably superior to simple averagi...
متن کاملMiro Web: Integrating Multiple Data Sources through Semistructured Data Types
The MIROWeb Esprit project has developed a unique technology to integrate multiple data sources through an object-relational model with semistructured data types. It addresses the problem of integrating irregular Web sources and regular relational databases through a mediated architecture based on a hybrid model, supporting relational, object and semistructured features. The project data exchan...
متن کاملAlgorithms for Graph Similarity and Subgraph Matching
We deal with two independent but related problems, those of graph similarity and subgraph matching, which are both important practical problems useful in several fields of science, engineering and data analysis. For the problem of graph similarity, we develop and test a new framework for solving the problem using belief propagation and related ideas. For the subgraph matching problem, we develo...
متن کاملCoarse grained parallel algorithms for graph matching
Parallel graph algorithm design is a very well studied topic. Many results have been presented for the PRAM model. However, these algorithms are inherently fine grained and experiments show that PRAM algorithms do often not achieve the expected speedup on real machines because of large message overheads. In this paper, we present coarse grained parallel graph algorithms with small message overh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2015
ISSN: 1041-4347
DOI: 10.1109/tkde.2015.2426714